Revolutionaries and spies: Spy-good and spy-bad graphs
نویسندگان
چکیده
منابع مشابه
Revolutionaries and spies: Spy-good and spy-bad graphs
We study a game on a graph G played by r revolutionaries and s spies. Initially, revolutionaries and then spies occupy vertices. In each subsequent round, each revolutionary may move to a neighboring vertex or not move, and then each spy has the same option. The revolutionaries win if m of them meet at some vertex having no spy (at the end of a round); the spies win if they can avoid this forev...
متن کاملRevolutionaries and Spies on Random Graphs
Pursuit-evasion games, such as the game of Revolutionaries and Spies, are a simplified model for network security. In the game we consider in this paper, a team of r revolutionaries tries to hold an unguarded meeting consisting of m revolutionaries. A team of s spies wants to prevent this forever. For given r and m, the minimum number of spies required to win on a graph G is the spy number σ(G,...
متن کاملSpy-Game on Graphs
We define and study the following two-player game on a graph G. Let k ∈ N∗. A set of k guards is occupying some vertices of G while one spy is standing at some node. At each turn, first the spy may move along at most s edges, where s ∈ N∗ is his speed. Then, each guard may move along one edge. The spy and the guards may occupy same vertices. The spy has to escape the surveillance of the guards,...
متن کاملRevolutionaries and Spies
Let G = (V,E) be a graph and let r, s, k be natural numbers. “Revolutionaries and Spies”, G(G, r, s, k) , is the following two-player game. The sets of positions for player 1 and player 2 are V r and ∗The research of the first author was supported by BSF grant no. 2006099, and by ISF grants Nos. 779/08, 859/08 and 938/06.
متن کاملRevolutionaries and spies on trees and unicyclic graphs
A team of r revolutionaries and a team of s spies play a game on a graph G. Initially, revolutionaries and then spies take positions at vertices. In each subsequent round, each revolutionary may move to an adjacent vertex or not move, and then each spy has the same option. The revolutionaries want to hold an unguarded meeting, meaning m revolutionaries at some vertex having no spy at the end of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.05.041